搜索 - 腾讯云开发者社区-腾讯云

文章/答案/技术大牛

发布

来自专栏SnailTyan
Diameter of Binary Tree
Solution /** * Definition for a binary tree node.
50920发布于 2019-05-25
来自专栏SnailTyan
Binary Tree Paths
Solution Recursive /** * Definition for a binary tree node. searchPath(root->right, s, result); } } }; Iterative /** * Definition for a binary tree node
50710发布于 2019-05-25
来自专栏皮皮星球
Tree - 110. Balanced Binary Tree
Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the depth of the Example 1: Given the following tree [3,9,20,null,null,15,7]: 3 / \ 9 20 / \ 15 7 Example 2: Given the following tree [1,2,2,3,3,null,null,4,4]: 1 / \ 2 2 / \ 代码： go： /** * Definition for a binary tree node.
63610发布于 2020-09-23
来自专栏皮皮星球
Tree - 226. Invert Binary Tree
Invert Binary Tree Invert a binary tree. / \ 7 2 / \ / \ 9 6 3 1 思路：递归求解翻转每个不为nil的节点代码： go： /** * Definition for a binary tree node
75820发布于 2020-09-23
来自专栏皮皮星球
Tree - 257. Binary Tree Paths
Binary Tree Paths Given a binary tree, return all root-to-leaf paths. 代码： go： /** * Definition for a binary tree node.
64720发布于 2020-09-23
来自专栏给永远比拿愉快
Leetcode: Balanced Binary Tree
题目： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the C++参考示例代码： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left
48020发布于 2019-01-22
来自专栏SnailTyan
Binary Tree Inorder Traversal
问题描述 Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. 2. /** * Definition for a binary tree node.
45510发布于 2019-05-25
来自专栏calmound
Maximum Depth of Binary Tree
问题：二叉树的最深深度 class Solution { public: void dfs(TreeNode *root,int step,int &MAX) { if(root==NULL) { if(MAX<step) MAX=step; return ; } dfs(root->left,step+1); dfs(root->right,step+1);
54630发布于 2018-04-17
来自专栏蛮三刀的后端开发专栏
Minimum Depth of Binary Tree
这题有意思的是，并不能直接将求最大深度的max改为min就完了，有很多坑在里面。一开始我以为只要将[],[0],[1,2]等情况考虑掉就可以了，其实在只有一边又子节点的情况下，是仍然需要遍历的。例如：
50420发布于 2019-03-26
来自专栏calmound
Binary Tree Preorder Traversal
二叉树的前序遍历递归实现 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode
68480发布于 2018-04-17
来自专栏calmound
Minimum Depth of Binary Tree
题意：二叉树的最小深度注意 1.当root为空的时候直接返回0，因为MIN赋值很大，所以如果不单独预判的话会返回MIN 2.判断树的深度应该到叶子节点，也就是左右子结点都为空的那个结点 3.树的深度的根节点深度为1 class Solution { public: void dfs(TreeNode *root,int &MIN,int step) { if(root==NULL) return ; if(root->
72870发布于 2018-04-17
来自专栏calmound
226 Invert Binary Tree
/** * Definition for a binary tree node.
62470发布于 2018-04-18
来自专栏皮皮星球
Tree - 94. Binary Tree Inorder Traversal
Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. 迭代也是使用list容器来充当栈代码： go ： /** * Definition for a binary tree node.
53210发布于 2020-09-23
来自专栏皮皮星球
Tree - 144. Binary Tree Preorder Traversal
Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes' values 思路：二叉树的先序遍历，递归求解和迭代，迭代使用list容器的链表代替栈来做代码： go： /** * Definition for a binary tree node.
49220发布于 2020-09-23
来自专栏皮皮星球
Tree - 145. Binary Tree Postorder Traversal
Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes' values 代码： go： /** * Definition for a binary tree node.
60610发布于 2020-09-23
来自专栏皮皮星球
Tree - 111. Minimum Depth of Binary Tree
Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. Example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its 代码： go： /** * Definition for a binary tree node.
59220发布于 2020-09-23
来自专栏calmound
Binary Tree Inorder Traversal
问题：二叉树中序遍历递归实现 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode
65860发布于 2018-04-17
来自专栏SnailTyan
Maximum Width of Binary Tree
Solution /** * Definition for a binary tree node.
1.2K20发布于 2019-05-25
来自专栏SnailTyan
Validate Binary Search Tree
Solution Recurrent /** * Definition for a binary tree node.
45910发布于 2019-05-25
来自专栏皮皮星球
Tree - 297. Serialize and Deserialize Binary Tree
Serialize and Deserialize Binary Tree Serialization is the process of converting a data structure or Design an algorithm to serialize and deserialize a binary tree. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure. ,null,null,4,5]" Clarification: The above format is the same as how LeetCode serializes a binary tree
57510发布于 2020-09-23

第 2 页第 3 页第 4 页第 5 页第 6 页第 7 页第 8 页第 9 页第 10 页第 11 页

点击加载更多

Diameter of Binary Tree

Binary Tree Paths

Tree - 110. Balanced Binary Tree

Tree - 226. Invert Binary Tree

Tree - 257. Binary Tree Paths

Leetcode: Balanced Binary Tree

Binary Tree Inorder Traversal

Maximum Depth of Binary Tree

Minimum Depth of Binary Tree

Binary Tree Preorder Traversal

Minimum Depth of Binary Tree

226 Invert Binary Tree

Tree - 94. Binary Tree Inorder Traversal

Tree - 144. Binary Tree Preorder Traversal

Tree - 145. Binary Tree Postorder Traversal

Tree - 111. Minimum Depth of Binary Tree

Binary Tree Inorder Traversal

Maximum Width of Binary Tree

Validate Binary Search Tree

Tree - 297. Serialize and Deserialize Binary Tree

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐